Relaxing the CFL Number of the Discontinuous Galerkin Method

نویسندگان

  • Noel Chalmers
  • Lilia Krivodonova
  • Ruibin Qin
چکیده

We propose a family of high order methods for solution of hyperbolic conservation laws which are based on the discontinuous Galerkin (DG) spatial discretization. In the standard DG method, the dispersion and dissipation errors and the spectrum of the semi-discrete scheme are related to the [ p p+1 ] Padé approximants of exp(z) and exp(−z). These Padé approximants are responsible for the superconvergent O(h2p+2) and O(h2p+1) errors in dispersion and dissipation, respectively, and the restriction of the CFL number when increasing the order of approximation, p. By modifying the DGM we obtain different rational approximations of the exponential, thereby sacrificing some of the superconvergence of the method, and construct new schemes which allow larger time steps than the original DGM while having the same order of convergence in the L2 norm. This is achieved through modifications to the numerical flux. The schemes preserve the attractive properties of the usual DGM, such as the high order accuracy and compact stencil.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new Runge-Kutta discontinuous Galerkin method with conservation constraint to improve CFL condition for solving conservation laws

We present a new formulation of the Runge-Kutta discontinuous Galerkin (RKDG) method [9, 8, 7, 6] for solving conservation Laws with increased CFL numbers. The new formulation requires the computed RKDG solution in a cell to satisfy additional conservation constraint in adjacent cells and does not increase the complexity or change the compactness of the RKDG method. Numerical computations for s...

متن کامل

Semi discrete discontinuous Galerkin methods and stage-exceeding-order, strong-stability-preserving Runge-Kutta time discretizations

This paper investigates the use of a special class of strong-stability-preserving (SSP) Runge–Kutta time discretization methods in conjunction with discontinuous Galerkin (DG) finite element spatial discretizatons. The class of SSP methods investigated here is defined by the property that the number of stages s is greater than the order k of the method. From analysis, CFL conditions for the lin...

متن کامل

A Conservation Constrained Runge-Kutta Discontinuous Galerkin Method with the Improved CFL Condition for Conservation Laws

We present a new formulation of the Runge-Kutta discontinuous Galerkin (RKDG) method [6, 5, 4, 3] for conservation Laws. The new formulation requires the computed RKDG solution in a cell to satisfy additional conservation constraint in adjacent cells and does not increase the complexity or change the compactness of the RKDG method. We use this new formulation to solve conservation laws on one-d...

متن کامل

A Runge-Kutta Discontinuous Galerkin Method with Conservation Constraints to Improve CFL Condition for Solving Conservation Laws

We present a new formulation of the Runge-Kutta discontinuous Galerkin (RKDG) method [7, 6, 5, 4] for conservation Laws. The new formulation requires the computed RKDG solution in a cell to satisfy additional conservation constraint in adjacent cells and does not increase the complexity or change the compactness of the RKDG method. We use this new formulation to solve conservation laws on one-d...

متن کامل

CFL Conditions for Runge-Kutta discontinuous Galerkin methods on triangular grids

We study time step restrictions due to linear stability constraints of Runge-Kutta Discontinuous Galerkin methods on triangular grids. The scalar advection equation is discretized in space by the Discontinuous Galerkin method with either the Lax-Friedrichs flux or the upwind flux, and integrated in time with various Runge-Kutta schemes designed for linear wave propagation problems or non-linear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2014